Integrals of polynomials associated with tableaux and the Garsia-Haiman conjecture
نویسندگان
چکیده
In a 1983 paper [M1], I. G. Macdonald introduced his well-known “constant term conjectures.” These conjectures concern a certain polynomial ∆ = ∆(G, k) that is indexed by a semisimple Lie algebra G and a positive integer k. The polynomial ∆ lives in Z[Φ, q], the group ring of the root lattice Φ of G over Z[q]. A basis for this ring, over Z[q], is the set of formal exponentials, ev, for v ∈ Φ that satisfy the relations ev · ew = ev+w. The conjecture asserts that the constant term of∆, meaning the part that is independent of the formal exponentials, has a nice factorization as a polynomial in q. Later, Macdonald [M2] generalized this work in the following way. He showed that there is a unique collection of polynomials Pν indexed by dominant weights ν, satisfying the following properties:
منابع مشابه
A Combinatorial Formula for the Hilbert Series of Bigraded Sn-Modules
We prove a combinatorial formula for the Hilbert series of the Garsia-Haiman bigraded Sn-modules as weighted sums over standard Young tableaux in the hook shape case. This method is based on the combinatorial formula of Haglund, Haiman and Loehr for the Macdonald polynomials and extends the result of A. Garsia and C. Procesi for the Hilbert series when q = 0. Moreover, we construct an associati...
متن کاملGarsia-Haiman modules for hook partitions and Green polynomials with two variables
The Garsia-Haiman modules are doubly graded modules for the symmetric groups, introduced by A. Garsia and M. Haiman [GH] to prove Macdonald’s positivity conjecture [M1]. These modules are defined for partitions of positive integers n, denoted by Dμ. The dimension of Dμ is given by n! whenever μ is a partition of n [H2]. As this fact implies, the Garsia-Haiman modules Dμ are isomorphic to the co...
متن کاملA Kicking Basis for the Two Column Garsia-haiman Modules
In the early 1990s, Garsia and Haiman conjectured that the dimension of the Garsia-Haiman module Rμ is n!, and they showed that the resolution of this conjecture implies the Macdonald Positivity Conjecture. Haiman proved these conjectures in 2001 using algebraic geometry, but the question remains to find an explicit basis for Rμ which would give a simple proof of the dimension. Using the theory...
متن کاملar X iv : 1 71 0 . 07 07 8 v 1 [ m at h . C O ] 1 9 O ct 2 01 7 A PROOF OF THE DELTA CONJECTURE WHEN q = 0
In [The Delta Conjecture, Trans. Amer. Math. Soc., to appear] Haglund, Remmel, Wilson introduce a conjecture which gives a combinatorial prediction for the result of applying a certain operator to an elementary symmetric function. This operator, defined in terms of its action on the modified Macdonald basis, has played a role in work of Garsia and Haiman on diagonal harmonics, the Hilbert schem...
متن کاملDual equivalence graphs, ribbon tableaux and Macdonald polynomials
We make a systematic study of a new combinatorial construction called a dual equivalence graph. Motivated by the dual equivalence relation on standard Young tableaux introduced by Haiman, we axiomatize such constructions and prove that the generating functions of these graphs are Schur positive. We construct a graph on k-ribbon tableaux which we conjecture to be a dual equivalence graph, and we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998